Computing polycyclic presentations for polycyclic rational matrix groups
نویسندگان
چکیده
منابع مشابه
refined solvable presentations for polycyclic groups
we describe a new type of presentation that, when consistent, describes a polycyclic group. this presentation is obtained by refining a series of normal subgroups with abelian sections. these presentations can be described effectively in computer-algebra-systems like {scshape gap} or {scshape magma}. we study these presentations and, in particular, we obtain consistency c...
متن کاملPractical Algorithms for Polycyclic Matrix Groups
Many fundamental problems are undecidable for in nite matrix groups. Polycyclic matrix groups represent a large class of groups for which these same problems are known to be decidable. In this paper we describe a suite of new algorithms for studying polycyclic matrix groups | algorithms for testing membership and for uncovering the polycyclic structure of the group. We also describe an algorith...
متن کاملAlgorithms for polycyclic-by-finite matrix groups
Let K be a number eld. We present several algorithms for working with polycyclic-by-nite subgroups of GL(n; K). Let G be a subgroup of GL(n; K) given by a nite generatingset of matrices. We describe an algorithm for deciding whether or not G is polycyclic-by-nite. For polycyclic-by-nite G, we describe an algorithm for deciding whether or not a given matrix is an element of G. We also describe a...
متن کاملA Practical Algorithm for Finding Matrix Representations for Polycyclic Groups
We describe a new algorithm for nding matrix representations for polycyclic groups given by nite presentations. In contrast to previous algorithms, our algorithm is e cient enough to construct representations for some interesting examples. The examples which we studied included a collection of free nilpotent groups, and our results here led us to a theoretical result concerning such groups.
متن کاملOn Ordered Polycyclic Groups
It has been asserted that any (full) order on a torsion-free, finitely generated, nilpotent group is defined by some F-basis of G and that the group of o-automorphisms of such a group is itself a group of the same kind: Examples provided herein demonstrate that both of these assertions are false; however, it is proved that the group of o-automorphisms of an ordered, polycyclic group is nilpoten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2005
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2005.05.003